Datalog: Datalog Rules Parameterized by Description Logics

نویسندگان

  • Jing Mei
  • Harold Boley
  • Jie Li
  • Virendrakumar C. Bhavsar
  • Zuoquan Lin
چکیده

Combining ontologies with rules has become a central topic in the Semantic Web. Bridging the discrepancy between these two knowledge representations, this paper introduces Datalog as a family of hybrid languages, where Datalog rules are parameterized by various DL (description logic) languages ranging from ALC to SHIQ . Making Datalog a decidable system with complexity of EXPTIME, we propose independent properties in the DL body as the restriction to hybrid rules, and weaken the safeness condition to balance the trade-off between expressivity and reasoning power. Building on existing well-developed techniques, we present a principled approach to enrich (RuleML) rules with information from (OWL) ontologies, and develop a prototype system integrating a rule engine (OO jDREW) with a DL reasoner (RACER). 2 Jing Mei, Harold Boley, Jie Li, Virendrakumar C. Bhavsar, and Zuoquan Lin

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DatalogDL: Datalog Rules Parameterized by Description Logics

Combining ontologies with rules has become a central topic in the Semantic Web. Bridging the discrepancy between these two knowledge representations, this paper introduces Datalog as a family of hybrid languages, where Datalog rules are parameterized by various DL (description logic) languages ranging from ALC to SHIQ . Making Datalog a decidable system with complexity of EXPTIME, we propose in...

متن کامل

DL+log: Tight Integration of Description Logics and Disjunctive Datalog

The integration of Description Logics and Datalog rules presents many semantic and computational problems. In particular, reasoning in a system fully integrating Description Logics knowledge bases (DL-KBs) and Datalog programs is undecidable. Many proposals have overcomed this problem through a “safeness” condition that limits the interaction between the DL-KB and the Datalog rules. Such a safe...

متن کامل

Adding Probabilities and Rules to Owl Lite Subsets Based on Probabilistic Datalog

This paper proposes two probabilistic extensions of variants of the OWL Lite description language, which are essential for advanced applications like information retrieval. The first step follows the axiomatic approach of combining description logics and Horn clauses: Subsets of OWL Lite are mapped in a sound and complete way onto Horn predicate logics (Datalog variants). Compared to earlier ap...

متن کامل

On Combining Description Logic Ontologies and Nonrecursive Datalog Rules

Reasoning in systems integrating Description Logics (DL) ontologies and Datalog rules is a very hard task, and previous studies have shown undecidability of reasoning in systems integrating (even very simple) DL ontologies with recursive Datalog. However, the results obtained so far constitute a very partial picture of the computational properties of systems combining DL ontologies and Datalog ...

متن کامل

Description Logics and Disjunctive Datalog - The Story so Far

In this paper we present an overview of our recent work on the relationship between description logics and disjunctive datalog. In particular, we reduce satisfiability and instance checking in SHIQ to corresponding problems in disjunctive datalog. This allows us to apply practically successful deductive database optimization techniques, such as magic sets. Interestingly, the reduction also allo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006